Hierarchic Inertial Projection: A Fast Distance Matrix Embedding Algorithm
نویسندگان
چکیده
-We have designed an improved method for solving the embedding problem, which consists in generating molecular conformations satisfying prescribed distance restraints. The problem was broken up into smaller subproblems by carrying out separate embeddings of subsets of the original point set. The relative orientation of the subsets were then determined by an additional embedding and the final coordinates of the full point set were obtained by rigid-body translations and rotations. The new approach was found to be considerably faster than the traditional method, and produced high-quality results when built into DRAGON, a Distance Geometry-based protein modelling tool developed in our laboratory. The method has a number of promising applications including the fast generation of model conformations from a set of distance restraints and macromolecular docking simulations. Copyright © 1996 Elsevier Science Ltd
منابع مشابه
Fast System Matrix Calculation in CT Iterative Reconstruction
Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...
متن کاملExtracting Dynamics Matrix of Alignment Process for a Gimbaled Inertial Navigation System Using Heuristic Dynamic Programming Method
In this paper, with the aim of estimating internal dynamics matrix of a gimbaled Inertial Navigation system (as a discrete Linear system), the discretetime Hamilton-Jacobi-Bellman (HJB) equation for optimal control has been extracted. Heuristic Dynamic Programming algorithm (HDP) for solving equation has been presented and then a neural network approximation for cost function and control input ...
متن کاملLarge Scale Spectral Clustering Using Resistance Distance and Spielman-Teng Solvers
Spectral clustering is a novel clustering method which can detect complex shapes of data clusters. However, it requires the eigen decomposition of the graph Laplacian matrix, which is proportion to O(n) and thus is not suitable for large scale systems. Recently, many methods have been proposed to accelerate the computational time of spectral clustering. These approximate methods usually involve...
متن کاملAn algorithm for `1 nearest neighbor search via monotonic embedding
Fast algorithms for nearest neighbor (NN) search have in large part focused on `2 distance. Here we develop an approach for `1 distance that begins with an explicit and exactly distance-preserving embedding of the points into `2. We show how this can efficiently be combined with random-projection based methods for `2 NN search, such as locality-sensitive hashing (LSH) or random projection trees...
متن کاملThe Fast Johnson-lindenstrauss Transform
While we omit the proof, we remark that it is constructive. Specifically, A is a linear map consisting of random projections onto subspaces of Rd. These projections can be computed by n matrix multiplications, which take time O(nkd). This is fast enough to make the Johnson-Lindenstrauss transform (JLT) a practical and widespread algorithm for dimensionality reduction, which in turn motivates th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Chemistry
دوره 21 شماره
صفحات -
تاریخ انتشار 1997